/**
 * 操作给定的二叉树，将其变换为源二叉树的镜像。
 *
 * Date: 2022-10-01
 * Time: 9:44
 */
public class Algorithm {
    /*
    public TreeNode Mirror (TreeNode pRoot) {
        if(pRoot == null) { return pRoot; }
        // write code here
        if(pRoot.left == null && pRoot.right == null) {
            return pRoot;
        }

        TreeNode tmp = pRoot.left;
        pRoot.left = pRoot.right;
        pRoot.right = tmp;

        Mirror(pRoot.left);
        Mirror(pRoot.right);

        return pRoot;
    }

     */
}
